Web Service Generation through Program Slicing
نویسندگان
چکیده
منابع مشابه
Web Service Generation through Program Slicing
As the development of web service (WS), applications based on web services (WS), which are convenient and platform-independent, have become increasingly popular in recent years. However, how to identify, generate and compose services are still open issues. This paper proposes a method based on program slicing to realize the generation and composition of web services. This paper introduces the m...
متن کاملComponent Identification Through Program Slicing
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic code. An associated tool is also introduced. This piece of research is part of a broader project on program understanding and re-engineering of legacy code supported by formal methods.
متن کاملAnalyzing Slicing of Program through Cohesion Metric
This paper presents a new cohesion metric for a program which is used to analyze the slicing criterion. Based on the value of propose cohesion metric it is decided to perform slicing in a program or not. The propose cohesion metrics is also evaluated analytically against Weyuker’s Property and perform comparison with the existing cohesion metrics of Meyers et al. The results in this paper shows...
متن کاملUnderstanding Function Behaviors through Program Slicing
We present conditioned slicing as a general slicing framework for program comprehension. A conditioned slice consists of a subset of program statements which preserves the behavior of the original program with respect to a set of program executions. The set of initial states of the program that characterize these executions is speci ed in terms of a rst order logic formula on the input variable...
متن کاملProgram Slicing
The concept of static program slicing was first introduced by Weiser. Ottenstein et al. indicated that an intraprocedural slice can be found in linear time by traversing a suitable graph representation of the program referred to as the program dependence graph (PDG). Horwitz et al. introduced algorithms to construct interprocedural slices by extending the program dependence graph to a supergrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2010
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2011.311119